Automated theorem proving - PDFSEARCH.IO - Document Search Engine

Automated theorem proving
Results: 768

#	Item
471	Blocked Clause Decomposition Marijn J. H. Heule? and Armin Biere?? The University of Texas at Austin and Johannes Kepler University Linz Abstract. We demonstrate that it is fairly easy to decompose any propositional form Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 14:11:30 Automated theorem proving Propositional calculus Boolean algebra Mathematical logic Logic in computer science Conjunctive normal form Boolean satisfiability problem Resolution Unit propagation Theoretical computer science Mathematics Logic
472	Everything You Always Wanted to Know About Blocked Sets (But Were Afraid to Ask) Tom´ aˇs Balyo1 , Andreas Fr¨ohlich2 , Marijn J. H. Heule3 , Armin Biere2 ? Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-07-31 10:00:09 Automated theorem proving Logic in computer science Propositional calculus NP-complete problems Logic programming Boolean satisfiability problem Unit propagation Conjunctive normal form Resolution Theoretical computer science Mathematics Mathematical logic
473	Efficient Extraction of Skolem Functions from QRAT Proofs Marijn J.H. Heule Martina Seidl and Armin Biere Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-07-31 09:58:16 Model theory Automated theorem proving Boolean algebra Metalogic First-order logic Function True quantified Boolean formula Skolem normal form Resolution Mathematics Logic Mathematical logic
474	Cube and Conquer: Guiding CDCL SAT Solvers by Lookaheads (PRELIMINARY VERSION; [removed]) ⋆ Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2011-09-25 04:19:32 Logic in computer science NP-complete problems Electronic design automation Formal methods Automated theorem proving Boolean satisfiability problem Satz Lookahead Solver Theoretical computer science Mathematics Applied mathematics
475	Trimming while Checking Clausal Proofs Marijn J.H. Heule, Warren A. Hunt, Jr., and Nathan Wetzler The University of Texas at Austin Abstract—Conflict-driven clause learning (CDCL) satisfiability solvers can emit more t Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 11:58:01 Unsatisfiable core Conjunctive normal form Resolution Five lemma Theorem Logic programming Unit propagation Automated proof checking Boolean satisfiability problem Logic Mathematics Automated theorem proving
476	Clause Elimination Procedures for CNF Formulas Marijn Heule1 , Matti J¨arvisalo2 , and Armin Biere3 1 3 Department of Software Technology, Delft University of Technology, The Netherlands Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 07:34:30 Automated theorem proving Mathematical logic Propositional calculus Logic in computer science NP-complete problems Conjunctive normal form Resolution Boolean satisfiability problem Unit propagation Theoretical computer science Logic Mathematics
477	Revisiting Hyper Binary Resolution Marijn J.H. Heule1,3 , Matti J¨arvisalo2 , and Armin Biere3 1 3 Department of Computer Science, The University of Texas at Austin, United States Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-01-02 14:06:39 Automated theorem proving Logic in computer science NP-complete problems Conjunctive normal form Resolution Unit propagation Boolean satisfiability problem Literal Transitivity Theoretical computer science Mathematical logic Mathematics
478	Covered Clause Elimination Marijn Heule∗ TU Delft, The Netherlands Matti J¨arvisalo† Univ. Helsinki, Finland Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 07:30:47 Automated theorem proving Logic in computer science NP-complete problems Logic programming Conjunctive normal form Boolean satisfiability problem Unit propagation Resolution Clause Theoretical computer science Mathematical logic Mathematics
479	DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs Nathan Wetzler, Marijn J. H. Heule, and Warren A. Hunt, Jr. ? Add to Reading List Source URL: www.cs.utexas.edu Language: English - Date: 2014-04-02 18:01:43 Automated theorem proving Formal methods NP-complete problems Constraint programming Logic in computer science True quantified Boolean formula Resolution Satisfiability Modulo Theories Unsatisfiable core Theoretical computer science Mathematics Logic
480	Blocked Clause Elimination and its Extensions Marijn J. H. Heule∗ joint work with Matti J¨arvisalo and Armin Biere Abstract Boolean satisfiability (SAT) has become a core technology in many application Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 08:16:51 NP-complete problems Conjunctive normal form Automated theorem proving Boolean satisfiability problem Resolution Logic programming 2-satisfiability Theoretical computer science Mathematics Applied mathematics

UPDATE